package 力扣日常刷题.木22一月.第10天0118;

/**
 * @author 帅小伙
 * @date 2022/1/18
 * @description
 *
 * dp[i][j]  i  到 j 最长公共子序列
 */
public class Demo18动态规划最长公共子序列 {

    public int longestCommonSubsequence(String text1, String text2) {
        int n = text1.length();
        int m = text2.length();
        int[][] dp = new int[n+1][m+1];
        for (int i = 1; i <= n ; i++) {
            char c1=text1.charAt(i-1);
            for (int j = 1; j <= m ; j++) {
                char c2 = text2.charAt(m-1);
                if(c1==c2){
                    dp[i][j] = dp[i-1][j-1]+1;
                }else{
                    dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]);
                }

            }
        }
        return dp[n][m];
    }
}
